Approximate Subgradient Methods for Lagrangian Relaxations on Networks
نویسنده
چکیده
Nonlinear network flow problems with linear/nonlinear side constraints can be solved by means of Lagrangian relaxations. The dual problem is the maximization of a dual function whose value is estimated by minimizing approximately a Lagrangian function on the set defined by the network constraints. We study alternative stepsizes in the approximate subgradient methods to solve the dual problem. Some basic convergence results are put forward. Moreover, we compare the quality of the computed solutions and the efficiency of these methods.
منابع مشابه
Approximate Subgradient Methods over Lagrangian Relaxations on Networks
where A is a node-arc incidencem×n-matrix, b is the production/demand m-vector, x are the flows on the arcs of the network represented by A, and x are the capacity bounds imposed on the flows of each arc. • The side constraints c(x) ≤ 0 are defined by c : <n → <r, such that c = [c1, · · · , cr], where ci(x) is either linear, or nonlinear and twice continuously differentiable on the feasible set...
متن کاملOn the Efficiency of the €-subgradient Methods over Nonlinearly Constrained Networks
The efficiency of the network flow techniques can be exploited in the solution of nonlinearly constrained network flow problems by means of approximate subgradient methods. In particular, we consider the case where the side constraints (non-network constraints) are convex. We propose to solve the dual problem by using &-subgradient methods given that the dual function is estimated by minimizing...
متن کاملSubgradient Methods for Saddle-Point Problems
We consider computing the saddle points of a convex-concave function using subgradient methods. The existing literature on finding saddle points has mainly focused on establishing convergence properties of the generated iterates under some restrictive assumptions. In this paper, we propose a subgradient algorithm for generating approximate saddle points and provide per-iteration convergence rat...
متن کاملApproximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
In this paper, we study methods for generating approximate primal solutions as a by-product of subgradient methods applied to the Lagrangian dual of a primal convex (possibly nondifferentiable) constrained optimization problem. Our work is motivated by constrained primal problems with a favorable dual problem structure that leads to efficient implementation of dual subgradient methods, such as ...
متن کاملInexact subgradient methods over nonlinearly constrained networks
The minimization of nonlinearly constrained network flow problems can be performed by using approximate subgradient methods. The idea is to solve this kind of problem by means of primal-dual methods, given that the minimization of nonlinear network flow problems can be efficiently done by exploiting the network structure. In this work it is proposed to solve the dual problem by using 2subgradie...
متن کامل